@InProceedings{YamadaBata:2017:CoStCo,
               author = "Yamada, Fernanda Miyuki and Batagelo, Harlen Costa",
          affiliation = "{Federal University of ABC} and {Federal University of ABC}",
                title = "A comparative study on computational methods to solve tangram 
                         puzzles",
            booktitle = "Proceedings...",
                 year = "2017",
               editor = "Torchelsen, Rafael Piccin and Nascimento, Erickson Rangel do and 
                         Panozzo, Daniele and Liu, Zicheng and Farias, Myl{\`e}ne and 
                         Viera, Thales and Sacht, Leonardo and Ferreira, Nivan and Comba, 
                         Jo{\~a}o Luiz Dihl and Hirata, Nina and Schiavon Porto, Marcelo 
                         and Vital, Creto and Pagot, Christian Azambuja and Petronetto, 
                         Fabiano and Clua, Esteban and Cardeal, Fl{\'a}vio",
         organization = "Conference on Graphics, Patterns and Images, 30. (SIBGRAPI)",
            publisher = "Sociedade Brasileira de Computa{\c{c}}{\~a}o",
              address = "Porto Alegre",
             keywords = "tangram, geometric puzzle, comparative study, heuristic 
                         programming.",
             abstract = "The tangram is a dissection puzzle composed of seven polygonal 
                         pieces which can be combined to form different patterns. Besides 
                         being a recreational puzzle, the tangram relates to a more general 
                         class of combinatorial NP-hard problems such as the bin packing 
                         problem and jigsaw puzzles. In this paper, we propose a 
                         comparative study of current computational methods for 
                         automatically solving tangram puzzles. In particular, we propose 
                         to implement and compare four approaches that employ strategies 
                         based on computational heuristics, genetic algorithms, artificial 
                         neural networks and algebraic representations. We intend to 
                         identify their similarities, their strengths and weaknesses in 
                         order to better understand the tangram puzzle problem, ultimately 
                         leading to an improved computational method for solving dissection 
                         puzzles.",
  conference-location = "Niter{\'o}i, RJ, Brazil",
      conference-year = "17-20 Oct. 2017",
             language = "en",
                  ibi = "8JMKD3MGPAW/3PJ9JSH",
                  url = "http://urlib.net/ibi/8JMKD3MGPAW/3PJ9JSH",
           targetfile = "comparative-study-computational.pdf",
        urlaccessdate = "2024, May 02"
}